Monochromatic Boxes in Colored Grids

نویسندگان

  • Joshua N. Cooper
  • Stephen Fenner
  • Semmy Purewal
چکیده

A d-dimensional grid is a set of the form L 1⁄4 1⁄2a1 × · · · ×1⁄2ad , where 1⁄2t 1⁄4 f1; : : : ; tg and aj is a positive integer for j ∈ 1⁄2d . A d-dimensional box is a set of the form fx1; y1g× · · · ×fxd; ydg for some integers xj, yj with j ∈ 1⁄2d , where xj ≠ yj for each j. We give conditions on the set of d-tuples ða1; : : : ; adÞ so that, for every coloring f : L → 1⁄2c , the grid L 1⁄4 1⁄2a1 × · · · ×1⁄2ad contains a box on which f is constant. In particular, we analyze the set of grids that are minimal with respect to this property.We show that, for d ≥ 3, this set has size Oðcð17·3−1Þ∕ 2Þ, and all its elements have volume Oðcð3−1Þ ∕ 2Þ as c → ∞.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monochromatic cycles and monochromatic paths in arc-colored digraphs

We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A path (or a cycle) is called monochromatic if all of its arcs are colored alike. A cycle is called a quasi-monochromatic cycle if with at most one exception all of its arcs are colored alike. A subdigraph H in D is called rainbow if all its arcs have different colors. A set N ⊆ V (D) is said to be a kernel b...

متن کامل

Kernels and cycles' subdivisions in arc-colored tournaments

Let D be a digraph. D is said to be an m-colored digraph if the arcs of D are colored with m colors. A path P in D is called monochromatic if all of its arcs are colored alike. Let D be an m-colored digraph. A set N ⊆ V (D) is said to be a kernel by monochromatic paths of D if it satisfies the following conditions: a) for every pair of different vertices u, v ∈ N there is no monochromatic direc...

متن کامل

Kernels by monochromatic paths and the color-class digraph

An m-colored digraph is a digraph whose arcs are colored with m colors. A directed path is monochromatic when its arcs are colored alike. A set S ⊆ V (D) is a kernel by monochromatic paths whenever the two following conditions hold: 1. For any x, y ∈ S, x 6= y, there is no monochromatic directed path between them. 2. For each z ∈ (V (D)− S) there exists a zS-monochromatic directed path. In this...

متن کامل

Kernels by monochromatic paths in digraphs with covering number 2

We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A subdigraph H of D is called monochromatic if all of its arcs are colored alike. A set N ⊆ V (D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and; (ii) for eve...

متن کامل

On monochromatic subgraphs of edge-colored complete graphs

In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic. For two nonempty graphs G and H without isolated vertices, the monochromatic Ramsey number mr(G,H) of G and H is the minimum integer n such that eve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2011